What if Chomsky were right?
نویسنده
چکیده
The outcome of scientific research depends on how a phenomenon is viewed and how the questions are phrased. This applies also to the nativist view of language acquisition. As a complement to MacWhinney’s discussion of nativism from the viewpoint of cognitive psychology, I would like to devote this commentary to the question of the title from the viewpoint of computational linguistics. Formally, the nativist approach has been based on a distinction between finite and infinite sets. Chomsky defines a language as an infinite set of strings (sequence of word forms) and a grammar as a filter which picks the grammatically correct strings from the free monoid1 over the finite lexicon of the language. Language acquisition is described in terms of a language acquisition device (LAD) which has the task of selecting from the infinite set of possible grammars the one which is correct for the language in question. The ‘logical problem of language acquisition’ is how the LAD can select a grammar which is correct for an infinite language, even though the data presented to the LAD (observed sentences) are necessarily finite. This problem is only made worse by Chomsky’s alleged degeneracy of input and poverty of negative evidence, focussed on by MacWhinney. Given that humans can obviously learn language anyway, something in addition to a finite set of data is required. According to Chomsky, it is some innate universal grammar, common to all languages. Differences between languages are attributed to different parameter settings of the universal grammar. As empirical proof for the existence of a universal grammar we are offered language structures claimed to be learned error-free. They are explained as belonging to that part of the universal grammar which is independent from languagedependent parameter setting. Structures claimed to involve error-free learning include
منابع مشابه
In Defense of Public Language
notion of 'common, public language' that remains mysterious...useless for any form of theoretical explanation....There is simply no way of making sense of this prong of the externalist theory of meaning and language, as far as I can see, or of any of the work in theory of meaning and philosophy of language that relies on such notions, a statement that is intended to cut rather a large swath. (C...
متن کاملSTABILIZER TOPOLOGY OF HOOPS
In this paper, we introduce the concepts of right, left and product stabilizers on hoops and study some properties and the relation between them. And we try to find that how they can be equal and investigate that under what condition they can be filter, implicative filter, fantastic and positive implicative filter. Also, we prove that right and product stabilizers are filters and if they are ...
متن کاملLambek Calculus and Formal Grammars
The question about the position of categorial grammars in the Chomsky hierarchy arose in late 1950s and early 1960s. In 1960 Bar-Hillel, Gaifman, and Shamir [1] proved that a formal language can be generated by some basic categorial grammar if and only if the language is context-free. They conjectured (see also [7]) that the same holds for Lambek grammars, i. e., for categorial grammars based o...
متن کاملRemarks on Denominal Verbs
Word meaning confronts us, as acutely as anything in syntax, with what Chomsky has called Plato’s problem. We know far more about the meaning of almost any word than we could have learned just from our exposure to uses of it. Communication would be unbearably laborious if we did not share with other speakers the ability to generalize the meanings of words in the right ways. As Fodor (1981) note...
متن کاملToward a Lexicalist Framework of Constraint-based Syntactic Ambiguity Reso- Lution. in 6.2 Discussion Eeects of Syntax in Human Sen- Tence Parsing: Evidence against a Structure- Based Proposal Mechanism. Journal of Ex- Perimental Psychology: Learning, Memory and (8)
a b c d d c b a d c b a d c b a Arrows are annotated by the substrucure to which they are applied d c b a Figure 3: Why ?! is weakly Church-Rosser Note that all that was said in this section generalizes beyond CCG derivations to any associative algebra. Given the rightmost subconstituent recovered using the normal form technique above, how should parsing proceed? Obviously, if the leftward look...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of child language
دوره 31 4 شماره
صفحات -
تاریخ انتشار 2004